A Fully Abstract Denotational Model for Observational Congruence
نویسندگان
چکیده
A domain theoretical denotational model is given for a simple sublanguage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence.
منابع مشابه
Relating Semantic Models for the Object Calculus Preliminary Report
Abadi and Cardelli have investigated several versions of the object calculus, a calculus for describing central features of object-oriented programs, with particular emphasis on various type systems. In this paper we study the properties of a denotational semantics due to Abadi and Cardelli vis-à-vis the notion of observational congruence for the calculus Ob1<:μ. In particular, we prove that th...
متن کاملA Fully Abstract Denotational Model for Observational Precongruence
A domain theoretical denotational model is given for a simple sublan-guage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence.
متن کاملA Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
We consider the calculus of Communicating Sequential Processes (CSP) [8] extended with action-guarded probabilistic choice and provide it with an operational semantics in terms of a suitable extension of Larsen and Skou’s [14] reactive probabilistic transition systems. We show that a testing equivalence which identifies two processes if they pass all tests with the same probability is a congrue...
متن کاملA Fully Abstract Semantics for Value-passing CCS for Trees
This paper provides a fully abstract semantics for valuepassing CCS for trees (VCCTS). The operational semantics is given both in terms of a reduction semantics and in terms of a labelled transition semantics. The labelled transition semantics is non-sequential, allowing more than one action occurring simultaneously. We develop the theory of behavioral equivalence by introducing both weak barbe...
متن کاملObservable Sequentiality and Full Abstraction 1 Full Abstraction and Sequentiality
One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995